Emotion clustering based on probabilistic linear discriminant analysis
نویسندگان
چکیده
This study proposes an emotion clustering method based on Probabilistic Linear Discriminant Analysis (PLDA). Each emotional utterance is modeled as a GMM mean supervector. Hierarchical clustering is applied to cluster supervectors that represent similar emotions using a likelihood ratio from a PLDA model. The PLDA model can be trained with a different emotional database from the test data, with different emotion categories, speakers, or even languages. The advantage of using a PLDA model is that it identifies emotion dependent subspaces of the GMM mean supervector space. Our proposed emotion clustering based on PLDA likelihood distance improves 5emotion clustering accuracy by 37.1% absolute compared to a baseline with Euclidean distance when PLDA model is trained with a separate set of speakers from the same database. Even when PLDA model is trained using a different database with a different language, clustering performance is improved by 11.2%.
منابع مشابه
On Model-Based Clustering, Classification, and Discriminant Analysis
The use of mixture models for clustering and classification has burgeoned into an important subfield of multivariate analysis. These approaches have been around for a half-century or so, with significant activity in the area over the past decade. The primary focus of this paper is to review work in model-based clustering, classification, and discriminant analysis, with particular attenti...
متن کاملبازشناسی جلوههای هیجانی با استفاده از تحلیل تفکیک پذیری مبتنی بر خوشه بندی چهره
Improvement of Facial expression recognition is aim of proposed method. This is a new formulation to the linear discriminant analysis. In the new formulation within-class and between-class covariance matrix are estimated on the each cluster and in the test phase new samples are mapped to the subspace that is related to the cluster of them. At the first we addressed clustering analysis of faces ...
متن کاملDimensional reduction of clustered data sets
We present a novel probabilistic latent variable model to perform linear dimensional reduction on data sets which contain clusters. The model simultaneously performs the clustering and the dimensional reduction in an unsupervised manner, providing an optimal visualisation of the clusterig. We prove that the resulting dimensional reduction results in Fisher’s linear discriminant analysis as a li...
متن کاملClassification by probabilistic clustering
This paper describes an approach to classification based on a probabilistic clustering method. Most current classifiers perform classification by modeling class conditional densities directly or by modeling class-dependent discriminant functions. The approach described in this paper uses classindependent multi-layer perceptrons (MLPs) to estimate the probability that two given feature vectors a...
متن کامل